package 算法;

/**
 * @author lo
 * @date 2021/11/6
 */
public class MaopaoCode {
    public static void main(String[] args) {
        int[] ints = {111, 2, 4, 6, 32, 23, 45, 57, 345, 34, 5};
        int a;
        for (int i = 0; i < ints.length - 1; i++) {
            for (int j = 0; j < ints.length - i - 1; j++) {
                if (ints[j] < ints[j + 1]) {
                    a = ints[j];
                    ints[j] = ints[j+1];
                    ints[j+1] = a;
                }
            }
        }
        for (int anInt : ints) {
            System.out.println("anInt = " + anInt);
        }
    }
}
